A Dynamic Flow Problem with Desired Distribution of Departures and Arrivals
نویسندگان
چکیده
منابع مشابه
Scheduling in Wireless Networks with Connection Arrivals and Departures
We consider wireless ad hoc networks in which each connection (file) traverses only one hop. We assume that files arrive for service at each link and a file departs when all its packets have been transmitted. The file size distribution can be arbitrary, but the file sizes are assumed to be bounded. We assume that a window flow control protocol regulates the injection of packets from each file i...
متن کاملa comparison of teachers and supervisors, with respect to teacher efficacy and reflection
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
15 صفحه اولOptimal Integration of Departures and Arrivals in Terminal Airspace
Coordination of operations with spatially and temporally shared resources, such as route segments, fixes, and runways, improves the efficiency of terminal airspace management. Problems in this category are, in general, computationally difficult compared to conventional scheduling problems. This paper presents a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSG...
متن کاملA game theoretic model of kleptoparasitism with strategic arrivals and departures of beetles at dung pats.
Dung beetles Onthophagus taurus lay their eggs in brood balls within dung pats. The dung that is used must be sufficiently fresh, and so beetles must keep moving from pat to pat to find fresh dung. If another beetle finds a brood ball it will usually eat the egg inside and lay its own egg in the brood ball instead of constructing its own ball. Thus, beetles will often stay near their eggs to gu...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1983
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.19.110